Design of Complex-valued Hopfield Associative Memory Based on Prespecified Attractive Domain

نویسندگان

  • Xiaoyu Liu
  • Kangling Fang
  • Lin Chen
  • Hongbing Zhu
چکیده

This paper proposes a connection weighting scheme of a complex-valued Hopfield neural network for associative memory constrained by given attractive domain. Both equilibrium conditions and stability analysis results are used in the synthesis procedure. We solve the equilibrium equation by singular value decomposition technique and obtain a general solution of the connection weight matrix with a free sub-matrix. Such general solution and the parameter matrix corresponding to the given attractive domain are contained in the inequations which are derived from stability analysis and can be represented as linear matrix inequations (LMIs). The connection weighting solution of such LMIs can guarantee stability and attractability of the network simultaneously. A simulation example of a 3-dimension complex-valued Hopfield neural network shows the proposed synthesis method. The simulation results demonstrate the attractive ability of two complex-valued vectors in the prespecified attractive domain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the EXISTENCE OF HOPFIELD NEURAL NETWORKS: SYNTHESIS OF HOPFIELD TYPE ASSOCIATIVE MEMORIES:

In this research paper, the problem of existence of the associative memory synthesized by Hopfield is addressed and solved. Using Hadamard matrix of suitable dimension, an algorithm to synthesize real valued Hopfield neural network is discussed. The problem of existence and synthesis of a certain complex Hopfield neural network is addressed and solved. Also, synthesis of real and complex Hopfie...

متن کامل

An Iterative Incremental Learning Algorithm for Complex-Valued Hopfield Associative Memory

This paper discusses a complex-valued Hopfield associative memory with an iterative incremental learning algorithm. The mathematical proofs derive that the weight matrix is approximated as a weight matrix by the complex-valued pseudo inverse algorithm. Furthermore, the minimum number of iterations for the learning sequence is defined with maintaining the network stability. From the result of si...

متن کامل

Design of Multi-valued Cellular Neural Networks for Associative Memories

Cellular neural networks (CNNs) are one type of interconnected neural network and differ from the well-known Hopfield model in that each cell has a piecewise linear output function. In this paper, we present a multi-valued CNN model in which each nonlinear element consists of a multi-valued output function. The function is defined by a linear combination of piecewise linear functions. We conduc...

متن کامل

A new design method for the complex-valued multistate Hopfield associative memory

A method to store each element of an integral memory set M subset {1,2,...,K}/sup n/ as a fixed point into a complex-valued multistate Hopfield network is introduced. The method employs a set of inequalities to render each memory pattern as a strict local minimum of a quadratic energy landscape. Based on the solution of this system, it gives a recurrent network of n multistate neurons with comp...

متن کامل

A Complex-Valued Hopfield Neural Network: Dynamics and Applications

Drawing important ideas from several sources, the idea of associative memory from psychology (Kohonen, 1977), the idea of Hebbian adaptation from neurophysiology (Hebb, 1949), the idea of neuron as a thresholding device from prior modeling work (McCulloch & Pitts, 1943) etc., Hopfield presented an elegant model of associative memory storage and retrieval in the brain (Hopfield, 1982; Hopfield, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010